Bounding the order of a group with a large character degree
نویسندگان
چکیده
منابع مشابه
Groups with a Character of Large Degree
Let G be a finite group of order n and V a simple C[G]-module of dimension d. For some nonnegative number e, we have n = d(d + e). If e is small, then the character of V has unusually large degree. We fix e and attempt to classify such groups. For e ≤ 3 we give a complete classification. For any other fixed e we show that there are only finitely many examples.
متن کاملBounding the Number of Character Degrees of a Solvable Group
A difficult problem in the character theory of solvable groups is to show that the number c.d. (G) of irreducible character degrees of a solvable group G is equal to or greater than d.l. (G), the derived length of G. Isaacs [4] has shown that d.l. (G) ^ 3 c.d. (G)-2 for every solvable group. Berger [1] subsequently proved that d.l. (G) < c.d. (G) when | G | is odd. This problem belongs to the c...
متن کاملA characterization of the symmetric group of prime degree
Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $Gcong S_p$ if and only if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$, whe...
متن کاملA note on the order graph of a group
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
متن کاملGroups with a Character of Large Degree Noah
Let G be a finite group of order n and V a simple C[G]-module of dimension d. For some nonnegative number e, we have n = d(d + e). If e is small, then the character of V has unusually large degree. We fix e and attempt to classify such groups. For e ≤ 3 we give a complete classification. For any other fixed e we show that there are only finitely many examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2011
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2011.08.037